Fuzzy Clustering Using Deterministic Annealing Method and Its Statistical Mechanical Characteristics
نویسندگان
چکیده
منابع مشابه
Deterministic and Simulated Annealing Approach to Fuzzy C-means Clustering
This paper explains the approximation of a membership function obtained by entropy regularization of the fuzzy c-means (FCM) method. By regularizing FCM with fuzzy entropy, a membership function similar to the Fermi-Dirac distribution function is obtained. We propose a new clustering method, in which the minimum of the Helmholtz free energy for FCM is searched by deterministic annealing (DA), w...
متن کاملDeterministic Annealing Framework in MMMs-Induced Fuzzy Co-Clustering and Its Applicability
Initialization problem is a significant issue in FCM-type clustering models, in which alternative optimization is often started with random initial partitions and can be trapped into local optima caused by bad initialization. The deterministic clustering approach is a practical procedure for utilizing a robust feature of very fuzzy partitions and tries to converge the iterative FCM process to a...
متن کاملModel clustering by deterministic annealing
Although training an ensemble of neural network solutions increases the amount of information obtained from a system, large ensembles may be hard to analyze. Since data clustering is a good method to summarize large bodies of data, we will show in this paper how to use clustering on instances of neural networks. We will describe an algorithm based on deterministic annealing, which is able to cl...
متن کاملFuzzy Entropy Based Fuzzy c-Means Clustering with Deterministic and Simulated Annealing Methods
This article explains how to apply the deterministic annealing (DA) and simulated annealing (SA) methods to fuzzy entropy based fuzzy c-means clustering. By regularizing the fuzzy c-means method with fuzzy entropy, a membership function similar to the Fermi-Dirac distribution function, well known in statistical mechanics, is obtained, and, while optimizing its parameters by SA, the minimum of t...
متن کاملImproved clustering using deterministic annealing with a gradient descent technique
Various techniques exist to solve the non-convex optimization problem of clustering. Recent developments have employed a deterministic annealing approach to solving this problem. In this letter a new approximation clustering algorithm, incorporating a gradient descent technique with deterministic annealing, is described. Results are presented for this new method, and its performance is compared...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Systems
سال: 2001
ISSN: 0915-647X,2432-9932
DOI: 10.3156/jfuzzy.13.5_102